Generalized convex set theoretic image recovery
نویسنده
چکیده
In set theoretic image recovery, the constraints which do not yield convex sets in the chosen Hilbert solution space cannot be enforced. In some cases, however , such constraints may yield convex sets in other Hilbert spaces. In this paper we introduce a generalized product space formalism, through which constraints that are convex in diierent Hilbert spaces can be combined. A nonconvex problem with several sets is reduced to a convex problem with two sets in the product space, where it is solved via an alternating projection method. Applications are discussed.
منابع مشابه
An adaptive level set method for nondifferentiable constrained image recovery
The formulation of a wide variety of image recovery problems leads to the minimization of a convex objective over a convex set representing the constraints derived from a priori knowledge and consistency with the observed signals. In previous years, nondifferentiable objectives have become popular due in part to their ability to capture certain features such as sharp edges. They also arise natu...
متن کاملGeneralized Thresholding Sparsity-Aware Online Learning in a Union of Subspaces
This paper studies a non-convexly constrained, sparse inverse problem in time-varying environments from a set theoretic estimation perspective. A new theory is developed that allows for the incorporation, in a unifying way, of different thresholding rules to promote sparsity, that may be even related to non-convex penalty functions. The resulted generalized thresholding operator is embodied in ...
متن کاملConvex set theoretic image recovery by extrapolated iterations of parallel subgradient projections
Solving a convex set theoretic image recovery problem amounts to finding a point in the intersection of closed and convex sets in a Hilbert space. The projection onto convex sets (POCS) algorithm, in which an initial estimate is sequentially projected onto the individual sets according to a periodic schedule, has been the most prevalent tool to solve such problems. Nonetheless, POCS has several...
متن کاملOptimality conditions for Pareto efficiency and proper ideal point in set-valued nonsmooth vector optimization using contingent cone
In this paper, we first present a new important property for Bouligand tangent cone (contingent cone) of a star-shaped set. We then establish optimality conditions for Pareto minima and proper ideal efficiencies in nonsmooth vector optimization problems by means of Bouligand tangent cone of image set, where the objective is generalized cone convex set-valued map, in general real normed spaces.
متن کاملCombettes : Convex Set Theoretic Image Recovery by Extrapolated Subgradient Projections 3
| Solving a convex set theoretic image recovery problem amounts to nding a point in the intersection of closed and convex sets in a Hilbert space. The POCS algorithm , in which an initial estimate is sequentially projected onto the individual sets according to a periodic schedule, has been the most prevalent tool to solve such problems. Nonetheless, POCS has several shortcomings: it converges s...
متن کامل